On coprime integral solutions of $ y^2 = x^3+ k$
نویسندگان
چکیده
منابع مشابه
Integer points on the curve Y2=X3±pkX
We completely solve diophantine equations of the form Y 2 = X3± pkX, where k is a positive integer, using a reduction to some quartic elliptic equations, which can be solved with well known methods.
متن کاملThe Number of Rational Points on Elliptic Curves y2 = x3 + a3 on Finite Fields
In this work, we consider the rational points on elliptic curves over finite fields Fp. We give results concerning the number of points Np,a on the elliptic curve y ≡ x + a(mod p) according to whether a and x are quadratic residues or non-residues. We use two lemmas to prove the main results first of which gives the list of primes for which -1 is a quadratic residue, and the second is a result ...
متن کاملA new algorithm to search for small nonzero |x3-y2| values
In relation to Hall’s conjecture, a new algorithm is presented to search for small nonzero k = ∣x3−y2∣ values. Seventeen new values of k < x1/2 are reported. 1. Hall’s conjecture Dealing with natural numbers, the difference (1.1) k = x − y is zero when x = t and y = t but, in other cases, it seems difficult to achieve small absolute values. For a given k ∕= 0, (1.1), known as Mordell’s equation...
متن کاملExamples of Mordell’s Equation
The equation y2 = x3 +k, for k ∈ Z, is called Mordell’s equation on account of Mordell’s long interest in it throughout his life. A natural number-theoretic task is the description of all rational and integral solutions to such an equation, either qualitatively (decide if there are finitely or infinitely many solutions in Z or Q) or quantitatively (list or otherwise conveniently describe all su...
متن کاملRational Points Near Curves and Small Nonzero |x3-y2| via Lattice Reduction
We give a new algorithm using linear approximation and lattice reduction to efficiently calculate all rational points of small height near a given plane curve C. For instance, when C is the Fermat cubic, we find all integer solutions of |x + y − z| < M with 0 < x ≤ y < z < N in heuristic time ≪ (logN)M provided M ≫ N , using only O(logN) space. Since the number of solutions should be asymptotic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1987
ISSN: 0386-2194
DOI: 10.3792/pjaa.63.13